Graph connection Laplacian and random matrices with random blocks
نویسندگان
چکیده
منابع مشابه
Random matrices and Laplacian growth
The theory of random matrices with eigenvalues distributed in the complex plane and more general “β-ensembles” (logarithmic gases in 2D) is reviewed. The distribution and correlations of the eigenvalues are investigated in the large N limit. It is shown that in this limit the model is mathematically equivalent to a class of diffusion-controlled growth models for viscous flows in the Hele-Shaw c...
متن کاملRandom Laplacian Matrices and Convex Relaxations
Abstract. The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms, often the size of the largest diagonal entry. Besides being a simple tool to obtain precise estimates on the largest eigenvalue of a large class of...
متن کاملSpectral Distributions of Adjacency and Laplacian Matrices of Random Graphs
In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the Laplacian matrices; (ii) under some further independent conditions, the normalized largest eigenvalues of the Laplacian matrices are dense in a compact interval a...
متن کاملRandom Matrices in 2D, Laplacian Growth and Operator Theory
Since it was first applied to the study of nuclear interactions by Wigner and Dyson, almost 60 years ago, Random Matrix Theory (RMT) has developed into a field of its own whithin applied mathematics, and is now essential to many parts of theoretical physics, from condensed matter to high energy. The fundamental results obtained so far rely mostly on the theory of random matrices in one dimensio...
متن کاملSpectral convergence of the connection Laplacian from random samples
Spectral methods that are based on eigenvectors and eigenvalues of discrete graph Laplacians, such as DiffusionMaps and Laplacian Eigenmaps, are often used for manifold learning and nonlinear dimensionality reduction. It was previously shown by Belkin&Niyogi (2007, Convergence of Laplacian eigenmaps, vol. 19. Proceedings of the 2006 Conference on Advances in Neural Information Processing System...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Inference
سال: 2015
ISSN: 2049-8764,2049-8772
DOI: 10.1093/imaiai/iav001